A new result on the distinctness of primitive sequences over Z/(pq) modulo 2

نویسندگان

  • Qun-Xiong Zheng
  • Wen-Feng Qi
چکیده

Let Z=(pq) be the integer residue ring modulo pq with odd prime numbers p and q. This paper studies the distinctness problem of modulo 2 reductions of two primitive sequences over Z=(pq), which has been studied by H.J. Chen and W.F. Qi in 2009. First, it is shown that almost every element in Z=(pq) occurs in a primitive sequence of order n > 2 over Z=(pq). Then based on this element distribution property of primitive sequences over Z=(pq), previous results are greatly improved and the set of primitive sequences over Z=(pq) that are known to be distinct modulo 2 is further enlarged.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Algorithms for Determining the Linear Complexity of Period Sequences

We introduce a fast algorithm for determining the linear complexity and the minimal polynomial of a sequence with period p over GF(q) , where p is an odd prime, q is a prime and a primitive root modulo p; and its two generalized algorithms. One is the algorithm for determining the linear complexity and the minimal polynomial of a sequence with period pq over GF(q), the other is the algorithm fo...

متن کامل

On Z2Z4[\xi]-Skew Cyclic Codes

Z2Z4-additive codes have been defined as a subgroup of Z r 2 ×Z s 4 in [5] where Z2, Z4 are the rings of integers modulo 2 and 4 respectively and r and s positive integers. In this study, we define a new family of codes over the set Zr2[ξ̄] × Z s 4[ξ] where ξ is the root of a monic basic primitive polynomial in Z4[x]. We give the standard form of the generator and parity-check matrices of codes ...

متن کامل

On the distinctness of modular reductions of maximal length sequences modulo odd prime powers

We discuss the distinctness problem of the reductions modulo M of maximal length sequences modulo powers of an odd prime p, where the integer M has a prime factor different from p. For any two different maximal length sequences generated by the same polynomial, we prove that their reductions modulo M are distinct. In other words, the reduction modulo M of a maximal length sequence is proved to ...

متن کامل

Linear complexity of quaternary sequences over Z4 based on Ding-Helleseth generalized cyclotomic classes

A family of quaternary sequences over Z4 is defined based on the DingHelleseth generalized cyclotomic classes modulo pq for two distinct odd primes p and q. The linear complexity is determined by computing the defining polynomial of the sequences, which is in fact connected with the discrete Fourier transform of the sequences. The results show that the sequences possess large linear complexity ...

متن کامل

Families of irreducible polynomials of Gaussian periods and matrices of cyclotomic numbers

Given an odd prime p we show a way to construct large families of polynomials Pq(x) ∈ Q[x], q ∈ C, where C is a set of primes of the form q ≡ 1 mod p and Pq(x) is the irreducible polynomial of the Gaussian periods of degree p in Q(ζq). Examples of these families when p = 7 are worked in detail. We also show, given an integer n ≥ 2 and a prime q ≡ 1 mod 2n, how to represent by matrices the Gauss...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2010  شماره 

صفحات  -

تاریخ انتشار 2010